import math
def isprime(n):
    if n == 1:
        return False
    elif n == 2:
        return True
    else:
        for i in range(2, int(math.sqrt(n) + 1)):
            if n % i == 0:
                return False
        return True

def thonsand(n):
    a = []
    for i in range(1, n + 1):
        if isprime(i):
            a.append(i)
    return a

def gdbh(n):
    a = []
    ls = thonsand(n)
    for i in ls:
        for j in ls:
            if n == i + j:
                a.append(i)
                a.append(j)
    return a


ls2 = gdbh(12)
ls3 = gdbh(152)
print(ls2)
print(ls3)